A Variable Beam Search Integrating A<sup>*</sup> Algorithm with Fixed Beam Search
نویسندگان
چکیده
منابع مشابه
Beam-Stack Search: Integrating Backtracking with Beam Search
We describe a method for transforming beam search into a complete search algorithm that is guaranteed to find an optimal solution. Called beam-stack search, the algorithm uses a new data structure, called a beam stack, that makes it possible to integrate systematic backtracking with beam search. The resulting search algorithm is an anytime algorithm that finds a good, sub-optimal solution quick...
متن کاملA Fuzzy Beam-Search Rule Induction Algorithm
This paper proposes a fuzzy beam search rule induction algorithm for the classification task. The use of fuzzy logic and fuzzy sets not only provides us with a powerful, flexible approach to cope with uncertainty, but also allows us to express the discovered rules in a representation more intuitive and comprehensible for the user, by using linguistic terms (such as low, medium, high) rather tha...
متن کاملLimited Discrepancy Beam Search
Beam search reduces the memory consumption of bestfirst search at the cost of finding longer paths but its memory consumption can still exceed the given memory capacity quickly. We therefore develop BULB (Beam search Using Limited discrepancy Backtracking), a complete memory-bounded search method that is able to solve more problem instances of large search problems than beam search and does so ...
متن کاملInformed Backtracking Beam Search
Beam searches are a very effective algorithm for solving problems that prove intractable to complete algorithms like weighted A* and greedy search. Unfortunately, the inadmissible pruning that is the hallmark of a beam search makes the algorithm incomplete. Existing complete extensions to beam search expand pruned nodes systematically according to generation order. Selecting pruned nodes to exp...
متن کاملComplete Anytime Beam Search
Beam search executes a search method, such as best-first search or depth-first search, but may abandon nonpromising search avenues in order to reduce complexity. Although it has existed for more than two decades and has been applied to many real-world problems, beam search still suffers from the drawback of possible termination with no solution or a solution of unsatisfactory quality. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 1996
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.116.5_611